A simple O ( n log n ) algorithm for nding the maximumdistance between two nite planar setsGodfried
نویسنده
چکیده
A simple O(n log n) algorithm is presented for computing the maximum Euclidean distance between two nite planar sets of n points. When the n points form the vertices of simple polygons, then the complexity reduces to O(n).
منابع مشابه
Draft: Eecient Algorithm for Nding Two Largest Empty Circles
This paper considers the problem of nding of 2 largest equal-radius non-overlapping circles in a simple polygon. We present O(n log 3 n) algorithm for nding disks in a polygon with n vertices. It improves recent algorithm of Bield et al. 1] that takes at least (n 2) time.
متن کاملOn a Simple, Practical, Optimal, Output-Sensitive Randomized Planar Convex Hull Algorithm
In this paper we present a truly practical and provably optimal O(n logh) time output-sensitive algorithm for the planar convex hull problem. The basic algorithm is similar to the algorithm presented in Chan, Snoeyink and Yapp2] where the median-nding step is replaced by an approximate median. We analyze two such schemes and show that for both methods, the algorithm runs in expected O(n log h) ...
متن کاملO - Convexity : Computing
We continue the investigation of computational aspects of restricted-orientation convexity (O-convexity) in two dimensions. We introduce one notion of an O-halfplane, for a set O of orientations, and we investigate O-connected convexity. The O-connected convex hull of a nite set X can be computed in time O(jXj log jXj + jOj). The O-connected hull is a basis for determining the O-convex hull of ...
متن کاملA fast algorithm for minimum weight odd circuits and cuts in planar graphs
We give a simple O(n3/2 log n) algorithm for finding a minimum weight odd circuit in planar graphs. By geometric duality, the same algorithm can be used to find minimum weight odd cuts. For general sparse graphs, the fastest known algorithms for these two problems take O(n2 log n) time and O(n3 log n) time, respectively. © 2004 Elsevier B.V. All rights reserved.
متن کاملMinimum Cuts and Shortest Cycles in Directed Planar Graphs via Noncrossing Shortest Paths
Let G be an n-node simple directed planar graph with nonnegative edge weights. We study the fundamental problems of computing (1) a global cut of Gwith minimum weight and (2) a cycle of G with minimum weight. The best previously known algorithm for the former problem, running in O(n log n) time, can be obtained from the algorithm of Łącki, Nussbaum, Sankowski, and Wulff-Nilsen for single-source...
متن کامل